EFFICIENT COMPUTATION OF SOBOL’ QUASI-RANDOM GENERATOR
نویسندگان
چکیده
منابع مشابه
An Efficient Discrete Log Pseudo Random Generator
The exponentiation function in a finite field of order p (a prime number) is believed to be a one-way function. It is well known that O(log log p) bits are simultaneously hard for this function. We consider a special case of this problem, the discrete logarithm with short exponents, which is also believed to be hard to compute. Under this intractibility assumption we show that discrete exponent...
متن کاملAn Efficient Pseudo-Random Generator with Applications to Public-Key Encryption and Constant-Round Multiparty Computation
We present a pseudo-random bit generator expanding a uniformly random bitstring r of length k/2, where k is the security parameter, into a pseudo-random bit-string of length 2k − log(k) using one modular exponentiation. In contrast to all previous high expansion-rate pseudo-random bit generators, no hashing is necessary. The security of the generator is proved relative to Paillier’s composite d...
متن کاملFaster Quasi Random Number Generator for Most Monte Carlo Simulations
Generating quasi-random sequences for Monte Carlo simulations has been proved of interest when comparing results with numbers coming from conventional pseudorandom sequences. Despite a fair amount of sound theoretical work on random number generation algorithms, theoretical gain is often eradicated by poor computer implementations. Recently, one of the authors of this paper showed that massive ...
متن کاملEfficient Encryption from Random Quasi-Cyclic Codes
We propose a framework for constructing efficient code-based encryption schemes from codes that do not hide any structure in their public matrix. The framework is in the spirit of the schemes first proposed by Alekhnovich in 2003 and based on the difficulty of decoding random linear codes from random errors of low weight. We depart somewhat from Aleknovich’s approach and propose an encryption s...
متن کاملA Quasi-Newton Algorithm for Efficient Computation of Gehan Estimates
The analysis of lifetime data is an important research area in statistics, particularly among econometricians and biostatisticians. The two most popular semi-parametric models are the proportional hazards model and the accelerated failure time (AFT) model. The proportional hazards model is computationally advantageous over virtually any other competing semi-parametric model because the ubiquito...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Students' Research in Technology & Management
سال: 2019
ISSN: 2321-2543
DOI: 10.18510/ijsrtm.2019.721